3

Bounding the Compression Loss of the FGK Algorithm

Year:
1999
Language:
english
File:
PDF, 147 KB
english, 1999
4

On the hardness of the minimum height decision tree problem

Year:
2004
Language:
english
File:
PDF, 177 KB
english, 2004
7

A note on the size of minimal covers

Year:
2007
Language:
english
File:
PDF, 102 KB
english, 2007
8

A randomized competitive algorithm for evaluating priced AND/OR trees

Year:
2008
Language:
english
File:
PDF, 535 KB
english, 2008
9

Improved bounds for asymmetric communication protocols

Year:
2002
Language:
english
File:
PDF, 75 KB
english, 2002
10

A strategy for searching with different access costs

Year:
2002
Language:
english
File:
PDF, 178 KB
english, 2002
12

Fast Searching in Trees

Year:
2001
File:
PDF, 273 KB
2001
14

An Approximation Algorithm for Binary Searching in

Year:
2011
Language:
english
File:
PDF, 540 KB
english, 2011
18

On Binary Searching with Nonuniform Costs

Year:
2002
Language:
english
File:
PDF, 282 KB
english, 2002
31

Improved approximations for the hotlink assignment problem

Year:
2011
Language:
english
File:
PDF, 501 KB
english, 2011
32

On the competitive ratio of evaluating priced functions

Year:
2011
Language:
english
File:
PDF, 379 KB
english, 2011
35

Trading Off Worst and Expected Cost in Decision Tree Problems

Year:
2016
Language:
english
File:
PDF, 901 KB
english, 2016
41

Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems

Year:
2018
Language:
english
File:
PDF, 371 KB
english, 2018